Simple Algorithm for GCD of Polynomials
نویسندگان
چکیده
Based on the Bezout approach we propose a simple algorithm to determine gcd of two polynomials which doesn’t need division, like Euclidean algorithm, or determinant calculations, Sylvester matrix algorithm. The needs only n steps for degree n. Formal manipulations give discriminant resultant any without needing division nor calculation.
منابع مشابه
Approximate GCD of Multivariate Polynomials
Given two polynomials F and G in R[x1, . . . , xn], we are going to find the nontrivial approximate GCD C and polynomials F , G ∈ R[x1, . . . , xn] such that ||F − CF ′|| < and ||G − CG′|| < , for some and some well defined norm. Many papers 1,2,3,5,8,10,11,13,15 have already discussed the problem in the case n = 1. Few of them 2,10,11 mentioned the case n > 1. Approximate GCD computation of un...
متن کاملGCD and Factorisation of multivariate polynomials
Some widely known techniques can be used to factorise univariate polynomials over the domain of integers. However, finding algorithms which factorise univariate and multivariate polynomials over Z and other domains is a little trickier. Several factorisation algorithms first need GCDs of the polynomials. Computing GCDs of polynomials is also necessary for adding rational functions. Both problem...
متن کاملApproximate Gcd of Inexact Univariate Polynomials
− The problem of finding the greatest common divisor (GCD) of univariate polynomials appears in many engineering fields. Despite its formulation is well-known, it is an ill-posed problem that entails numerous difficulties when the coefficients of the polynomials are not known with total accuracy, as, for example, when they come from measurement data. In this work we propose a novel GCD estimati...
متن کاملProving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresultants algorithm. Up to our knowledge it is the first mechanized proof of this result.
متن کاملFactorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a universal denominator) such that the denominator of each of rational solutions (if exist) of the given equation divides U(x). We consider two types of such algorithms. One of them is based on constructing a set of irreduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: WSEAS transactions on mathematics
سال: 2022
ISSN: ['1109-2769', '2224-2880']
DOI: https://doi.org/10.37394/23206.2022.21.99